- nonseparable graph
- неразложимый граф
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
Biconnected graph — In the mathematical discipline of graph theory, a biconnected graph is a connected graph with no articulation vertices.In other words, a biconnected graph is nonseparable, meaning if any vertex were to be removed, the graph will remain… … Wikipedia